Search results for "Generalized independent set problem"

showing 1 items of 1 documents

The directed profitable rural postman problem with incompatibility constraints

2017

[EN] In this paper, we study a variant of the directed rural postman problem (RPP) where profits are asso- ciated with arcs to be served, and incompatibility constraints may exist between nodes and profitable arcs leaving them. If convenient, some of the incompatibilities can be removed provided that penalties are paid. The problem looks for a tour starting and ending at the depot that maximizes the difference between collected profits and total cost as sum of traveling costs and paid penalties, while satisfying remaining incompatibilities. The problem finds application in the domain of road transportation service, and in particular in the context of horizontal collaboration among carriers …

050210 logistics & transportationService (systems architecture)Mathematical optimization021103 operations researchInformation Systems and ManagementGeneral Computer ScienceComputer science05 social sciences0211 other engineering and technologiesContext (language use)Incompatibility constraints02 engineering and technologyManagement Science and Operations ResearchGeneralized independent set problem Incompatibility constraints Routing Rural postman problem Management Science and Operations Research Information Systems and ManagementIndustrial and Manufacturing EngineeringGeneralized independent set problemDomain (software engineering)Rural postman problemModeling and SimulationIndependent set0502 economics and businessRouting (electronic design automation)MATEMATICA APLICADARouting
researchProduct